Weak convergence of the supremum distance for supersmooth kernel deconvolution
نویسنده
چکیده
We derive the asymptotic distribution of the supremum distance of the deconvolution kernel density estimator to its expectation for certain supersmooth deconvolution problems. It turns out that the asymptotics are essentially different from the corresponding results for ordinary smooth deconvolution.
منابع مشابه
Deconvolution with Supersmooth Distributions
The desire to recover the unknown density when data are contaminated with errors leads to nonparametric deconvolution problems. Optimal global rates of convergence are found under the weighted Lp-loss (1 $ p $ 00). It appears that the optimal rates of convergence are extremely slow for supersmooth error distributions. To overcome the difficulty, we examine how large the noise level can be for d...
متن کاملWavelet deconvolution
This paper studies the issue of optimal deconvolution density estimation using wavelets. We explore the asymptotic properties of estimators based on thresholding of estimated wavelet coe cients. Minimax rates of convergence under the integrated square loss are studied over Besov classes B pq of functions for both ordinary smooth and supersmooth convolution kernels. The minimax rates of converge...
متن کاملMinimax rates of convergence for Wasserstein deconvolution with supersmooth errors in any dimension
The subject of this paper is the estimation of a probability measure on R from data observed with an additive noise, under the Wasserstein metric of order p (with p ≥ 1). We assume that the distribution of the errors is known and belongs to a class of supersmooth distributions, and we give optimal rates of convergence for the Wasserstein metric of order p. In particular, we show how to use the ...
متن کاملSome thoughts on the asymptotics of the deconvolution kernel density estimator
Via a simulation study we compare the finite sample performance of the deconvolution kernel density estimator in the supersmooth deconvolution problem to its asymptotic behaviour predicted by two asymptotic normality theorems. Our results indicate that for lower noise levels and moderate sample sizes the match between the asymptotic theory and the finite sample performance of the estimator is n...
متن کاملQuadratic functional estimation in view of minimax goodness-of-fit testing from noisy data
We consider the convolution model Y random variables X i having common unknown density f are observed with an additive i.i.d. noise, independent of X s. We assume that the density f belongs to a smoothness class, has a characteristic function described either by a polynomial |u| −β , β > 1/2 (Sobolev class) or by an exponential exp(−α|u| r), α, r > 0 (called supersmooth), as |u| → ∞. The noise ...
متن کامل